Large-scale test data set for location problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An effective heuristic for large-scale capacitated facility location problems

The Capacitated Facility Location Problem (CFLP) consists of locating a set of facilities with capacity constraints to satisfy the demands of a set of clients at the minimum cost. In this paper we propose a simple and effective heuristic for largescale instances of CFLP. The heuristic is based on a Lagrangean relaxation which is used to select a subset of “promising” variables forming the core ...

متن کامل

A heuristic method for large-scale multi-facility location problems

A heuristic method for solving large-scale multi–facility location problems is presented. The method is analogous to Cooper’s method [3], using the authors’ single facility location method [20] as a parallel subroutine, and reassigning customers to facilities using the heuristic of Nearest Center Reclassification. Numerical results are reported.

متن کامل

Fast heuristics for large scale covering-location problems

We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These heuristics are compared on a set of 152 real-life instances arising in cytological screening. 2002 Elsevier Science Ltd. All rights reserved.

متن کامل

A Lagrangian-based heuristic for large-scale set covering problems

We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state of the art codes on a test-bed provided by the company, which includes instances with sizes ranging from 50,000 variables and 500 constraints to 1,000,000 variables ...

متن کامل

Hessian-Based Model Reduction for Large-Scale Data Assimilation Problems

Assimilation of spatiallyand temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-dimensional control spaces in the form of discretized initial conditions. Solution of such inverse problems in “real-time” is often intractable. This motivates the construction of reduced-order models that can be used as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Data in Brief

سال: 2018

ISSN: 2352-3409

DOI: 10.1016/j.dib.2018.01.008